Software synthesis for dynamic data flow graph

نویسندگان

  • Chabong Choi
  • Soonhoi Ha
چکیده

Data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous Data Flow (SDF) graph, which can not represent the control structure of the application. On the other hand, Dynamic Data Flow (DDF) graph can express the control structure, such as conditionals and data dependent iterations. This paper synthesizes a C code for a DDF graph which includes not only the functions associated with the nodes of the graph, but also the run-time scheduler and the run-time buffer manager which can execute a DDF graph without deadlock with bounded memory requirement. In addition, this paper suggests a hierarchical implementation of DDF which enhances the efSiciency of run-time scheduling by clustering SDF type nodes as a specific macro node.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Software Synthesis for Dynamic Data Flow Graph by

Data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous Data Flow (SDF) graph, a special case of data flow graph [Lee87a]. Even though the static p...

متن کامل

A Survey Of Graph Based Software Watermarking

Software watermarking involves embedding a unique identifier within a piece of software, to discourage software theft. The global revenue loss due to software piracy was estimated to be more than $50 billion in 2008. We survey the proposed software watermarking algorithms based on graph encoding. Graph based watermarking schemes, like other watermarking schemes, can be divided into two groups: ...

متن کامل

Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

متن کامل

The Simulation and Control of Ammonia Unit of Shiraz Petrochemical Complex, Iran

The aim of this paper is the steady state and dynamic simulations of the ammonia unit of Shiraz petrochemical complex and system behavior study versus the feed flow rate change for producing a good quality product. The ammonia unit consists of the reformer units, shift converter units, carbon dioxide absorption unit, methanation unit, and ammonia synthesis unit. For this purpose, in the first s...

متن کامل

The Hermod behavioral synthesis system

Hermod is an interactive behavioral synthesis program developed at Stanford University. Using a combined control and data flow graph (C/DFG) as an intermediate representation, Hermod generates functional blocks and their interconnection from L -havioral descriptions. Hermod supports a menu-driven interface, displaying the control and data flow graph with a set of legitimate dming-cus and its ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997